Electric Vehicle Routing, Arc Routing, and Team Orienteering Problems in Sustainable Transportation

نویسندگان

چکیده

The increasing use of electric vehicles in road and air transportation, especially last-mile delivery city mobility, raises new operational challenges due to the limited capacity batteries. These limitations impose additional driving range constraints when optimizing distribution mobility plans. During last years, several researchers from Computer Science, Artificial Intelligence, Operations Research communities have been developing optimization, simulation, machine learning approaches that aim at generating efficient sustainable routing plans for hybrid fleets, including both internal combustion engine vehicles. After contextualizing relevance promoting transportation practices, this paper reviews existing work field vehicle problems. In particular, we focus on articles related well-known routing, arc team orienteering review is followed by numerical examples illustrate gains can be obtained employing optimization methods aforementioned field. Finally, research opportunities are highlighted.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Team Orienteering Arc Routing Problem

The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem (TOP). In the TOARP a set of potential customers, each associated with an arc of a directed graph, is available and a profit is collected when a potential customer is served that is when the associated arc is traversed. A fleet of vehicles is available to visit the cust...

متن کامل

A matheuristic for the Team Orienteering Arc Routing Problem

In the Team Orienteering Arc Routing Problem (TOARP) the potential customers are located on the arcs of a graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for...

متن کامل

STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

متن کامل

Dissimilar arc routing problems

Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When t...

متن کامل

Planning Problems in Arc Routing

Planning problems over multi-period horizons occur in arc routing but are neglected by OR researchers. This paper presents these new problems, a classification and a hybrid GA able to tackle the planning and scheduling levels simultaneously.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Energies

سال: 2021

ISSN: ['1996-1073']

DOI: https://doi.org/10.3390/en14165131